Moving Past the Minimum Information Partition: How To Quickly and Accurately Calculate Integrated Information

نویسندگان

  • Daniel Toker
  • Friedrich Sommer
چکیده

An outstanding challenge with the Integrated Information Theory of Consciousness (IIT) is to find a way of rapidly and accurately calculating integrated information from neural data. A number of measures of integrated information based on time series data have been proposed, but most measures require finding the “Minimum Information Partition” of a network, which is computationally expensive and not practical for real brain data. Here, we introduce a novel partition, the Maximum Modularity Partition, across which to quickly calculate integrated information. We also introduce a novel detection task on simulated data to evaluate the performance of integrated information measures across different partitions. We show that integrated information can be reliably and quickly calculated across the Maximum Modularity Partition, as well as the previously proposed atomic partition, even in relatively large networks, which constitutes an advance in researchers’ ability to empirically test the predictions of IIT in real brain data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Integration In Large Brain Networks

O the past decade, various measures of "integrated information" have been proposed. These measures attempt to quantify how much more information a system of coupled parts carries about itself than the sum of information carried by those parts. In other words, these measures try to assess how much global information is available in a system. The possibility of measuring integrated information ha...

متن کامل

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...

متن کامل

Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many of the problems considered in optimization and learning assume that solutions exist in a dynamic. Hence, algorithms are required that dynamically adapt with the problem’s conditions and search new conditions. Mostly, utilization of information from the past allows to quickly adapting changes after. This is the idea underlining the use of memory in this field, what involves key design issue...

متن کامل

Analysis and Forecast of Mining Accidents in Pakistan

In the mining sector, the barrier to obtain an efficient safety management system is the unavailability of future information regarding the accidents. This paper aims to use the auto-regressive integrated moving average (ARIMA) model, for the first time, to evaluate the underlying causes that affect the safety management system corresponding to the number of accidents and fatalities in the surf...

متن کامل

A Proposed Architecture for Designing Integrated Information Systems in Research and Development Department of Universities of Medical Sciences: A Case Study of Ahvaz Jundishapur University of Medical Sciences

Background and Aim: This study aimed to propose a consistent architecture to design integrated and flexible information systems for the Vice-Chancellor for Research and Technology of Ahvaz Jundishapur University of Medical Sciences (AJUMS).  Materials and Methods: This applied research employed an integrated design based on business system planning (BSP) and James Martin's model for the design...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016